Optimal relative error rational approximations to ex
نویسندگان
چکیده
منابع مشابه
Solving Burgers' Equation Using Optimal Rational Approximations
Abstra t. We solve vis ous Burger's equation using a fast and a urate algorithm referred to here as the redu tion algorithm for omputing near optimal rational approximations. Given a proper rational fun tion with n poles, the redu tion algorithm omputes (for a desired L ∞ -approximation error) a rational approximation of the same form, but with a (near) optimally small number m ≪ n of poles. Al...
متن کاملRational Approximations to n
Using an IBM 1130 computer, we have generated the first 20,000 partial quotients in the ordinary continued-fraction representation of x.
متن کاملRational Approximations to Rational Models of Categorization
Can statistical machine learning theories and algorithms help explain human learning? Broadly speaking, machine learning studies the fundamental laws that govern all learning processes, including both artificial systems (e.g., computers) and natural systems (e.g., humans). It has long been understood that theories and algorithms from machine learning are relevant to understanding aspects of hum...
متن کاملSeries of Error Terms for Rational Approximations of Irrational Numbers
Let pn/qn be the n-th convergent of a real irrational number α, and let εn = αqn−pn. In this paper we investigate various sums of the type ∑ m εm, ∑ m |εm|, and ∑ m εmx m. The main subject of the paper is bounds for these sums. In particular, we investigate the behaviour of such sums when α is a quadratic surd. The most significant properties of the error sums depend essentially on Fibonacci nu...
متن کاملError Bounds for Lanczos Approximations of Rational Functions of Matrices
Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper we consider the case that A is Hermitian and that f is a rational function. We assume that the Lanczos method is used to compute approximations for f(A)v and we show how to obtain a posteriori upper and lower bounds on the `2-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1984
ISSN: 0021-9045
DOI: 10.1016/0021-9045(84)90019-4